Checking Equality and Regularity for Normed BPA with Silent Moves
نویسنده
چکیده
The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable.
منابع مشابه
Checking Equality and Regularity for nBPA with Silent Moves
The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable.
متن کاملRegularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time
We consider the problem of deciding regularity of normed BPP and normed BPA processes. A process is regular if it is bisimilar to a process with finitely many states. We show that regularity of normed BPP and normed BPA processes is decidable in polynomial time and we present constructive regularity tests. Combining these two results we obtain a rich subclass of normed PA processes (called sPA)...
متن کاملA Polynomial Time Algorithm for Deciding Branching Bisimilarity on Totally Normed BPA
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of branching bisimilarity on totally normed BPA lies. This paper confirms that this problem is polynomial-time decidable. To our knowledge, in the presence of silent transitions, this is the first bisimilarity checking ...
متن کاملTwo Lower Bounds for BPA
Branching bisimilarity on normed Basic Process Algebra (BPA) was claimed to be EXPTIMEhard in previous papers without any explicit proof. Recently it is reminded by Jančar that the claim is not so dependable. In this paper, we develop a new complete proof for EXPTIMEhardness of branching bisimilarity on normed BPA. We also prove the associate regularity problem on normed BPA is PSPACE-hard and ...
متن کاملNormed BPA vs. Normed BPP Revisited
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process. This improves the previously known exponential upper bound by Černá, Křet́ınský, Kučera (1999). The algorithm relies on a polynomial bound for the “finite-state core” of the transition system generated by the BPP process. The bound is derived from the “prime form” of the underlying...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013